Positional Connected Component Labeling Algorithm

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Fast connected-component labeling

Article history: Received 27 March 2008 Received in revised form 2 September 2008 Accepted 20 October 2008

متن کامل

Block-Based Connected-Component Labeling Algorithm Using Binary Decision Trees

In this paper, we propose a fast labeling algorithm based on block-based concepts. Because the number of memory access points directly affects the time consumption of the labeling algorithms, the aim of the proposed algorithm is to minimize neighborhood operations. Our algorithm utilizes a block-based view and correlates a raster scan to select the necessary pixels generated by a block-based sc...

متن کامل

Optimizing Connected Component Labeling Algorithms

This paper presents two new strategies that can be used to greatly improve the speed of connected component labeling algorithms. To assign a label to a new object, most labeling algorithms use a scanning step that examines some of its neighbors. The first strategy exploits the dependencies among the neighbors to reduce the number of neighbors examined. When considering 8-connected components in...

متن کامل

Connected Component Labeling in CUDA

Connected component labeling (CCL) is a task of detecting connected regions in input data, and it finds its applications in pattern recognition, computer vision, and image processing. We present a new algorithm for connected component labeling in 2-D images implemented in CUDA. We first provide a brief overview of the CCL problem together with existing CPU-oriented algorithms. The rest of the c...

متن کامل

Efficient Connected Component Labeling on RISC Architectures

This article introduces two fast algorithms for Connected Component Labeling of binary images, a peculiar case of coloring. The first one, SelkowDT is pixel-based and a Selkow’s algorithm combined with the Decision Tree optimization technique. The second one called Light Speed Labeling is segment-based line-relative labeling and was especially thought for commodity RISC architectures. An extens...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Indian Journal of Science and Technology

سال: 2013

ISSN: 0974-6846,0974-5645

DOI: 10.17485/ijst/2014/v7i3.5